Underected graph
In undirected graphs G = (V, E), the connections between vertices V are indicated by edges E.
Explanation
The edges have no direction. Each edge can be traversed in both directions.
Underected graph with 5 vertices and 6 edges
In undirected graphs G = (V, E), the connections between vertices V are indicated by edges E.
The edges have no direction. Each edge can be traversed in both directions.
Underected graph with 5 vertices and 6 edges